On the Disjunctive Markov Principle
نویسنده
چکیده
In this note we show that over a strong (semi-)intuitionistic base theory, the recursive comprehension principle ∆1-CA does not imply the disjunctive Markov principle MP ∨.
منابع مشابه
Some principles weaker than Markov's principle
We systematically study several principles and give a principle which is weaker than disjunctive Markov’s principle (MP∨). We also show that the principle is underivable and strictly weaker than MP∨ in certain extensions of the system EL of elementary analysis.
متن کاملImplications, coimplications and left semi-uninorms on a complete lattice
In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...
متن کاملNonlinear disjunctive kriging for the estimating and modeling of a vein copper deposit
ABSTRACT Estimation of mineral resources and reserves with low values of error is essential in mineral exploration. The aim of this study is to estimate and model a vein type deposit using disjunctive kriging method. Disjunctive Kriging (DK) as an appropriate nonlinear estimation method has been used for estimation of Cu values. For estimation of Cu values and modelling of the distributio...
متن کاملCausal models have no complete axiomatic characterization
Markov networks and Bayesian networks are effective graphic representations of the dependencies embedded in probabilistic models. It is well known that independencies captured by Markov networks (called graph-isomorphs) have a finite axiomatic characterization. This paper, however, shows that independencies captured by Bayesian networks (called causal models) have no axiomatization by using eve...
متن کاملMDD Propagation for Disjunctive Scheduling
Disjunctive scheduling is the problem of scheduling activities that must not overlap in time. Constraint-based techniques, such as edge finding and not-first/not-last rules, have been a key element in successfully tackling large and complex disjunctive scheduling problems in recent years. In this work we investigate new propagation methods based on limited-width Multivalued Decision Diagrams (M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 103 شماره
صفحات -
تاریخ انتشار 2015